#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <cstdio>
using namespace std;
typedef long long ll;
ll a[1007];
int main() {
	int n;
	cin>>n;
	for (int i=0; i<n; ++i) scanf("%lld", &a[i]);
	map<ll, vector<ll> > m;
	set<ll> s;
	for (int i=0; i<n; ++i) {
		for (int j=i+1; j<n; ++j) {
			m[a[i]+a[j]].push_back(a[i]);
			m[a[i]+a[j]].push_back(a[j]);
		}
	}
	bool flag=false;
	for (int i=0; i<n; ++i) {
		for (int j=i+1; j<n; ++j) {
			int z=-(a[i]+a[j]);
			int len=m[z].size();
			for (int k=0; k<len; k+=2) {
				if (m.count(z)) {
					s.clear();
					s.insert(a[i]); s.insert(a[j]); s.insert(m[z][k]); s.insert(m[z][k+1]);
					if (s.size()==4) {
						flag=true;
						break;
					}
				}
			}
			if (flag) break;
		}
		if (flag) break;
	}
	if (flag) cout<<"Yes"<<endl;
	else cout<<"No"<<endl;
	return 0;
} 
